Optimal set partitioning, matchings and lagrangian duality

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existence and Lagrangian Duality .for Maximizations of Set-Valued Functions

The maximization with respect to a cone of a set-valued function into possibly infinite dimensions is defined; some existence results are established; and a Lagrangian duality theory is developed.

متن کامل

Approximate Fenchel-Lagrangian Duality for Constrained Set-Valued Optimization Problems

In this article, we construct a Fenchel-Lagrangian ε-dual problem for set-valued optimization problems by using the perturbation methods. Some relationships between the solutions of the primal and the dual problems are discussed. Moreover, an ε-saddle point theorem is proved.

متن کامل

Lagrangian duality and perturbational duality I ∗

Our approach to the Karush-Kuhn-Tucker theorem in [OSC] was entirely based on subdifferential calculus (essentially, it was an outgrowth of the two subdifferential calculus rules contained in the Fenchel-Moreau and Dubovitskii-Milyutin theorems, i.e., Theorems 2.9 and 2.17 of [OSC]). On the other hand, Proposition B.4(v) in [OSC] gives an intimate connection between the subdifferential of a fun...

متن کامل

Duality – A Lagrangian Approach

The objective of this module is to understand key problems that arise when moving from finite dimensional linear programs to infinite dimensional linear programs. Students are introduced to the theory of linear programming in 36900. In 36900 the primary focus is on linear and integer programs with a finite number of constraints and variables. However, there are many applications where the numbe...

متن کامل

Convex Optimization and Lagrangian Duality

Finally the Lagranage dual function is given by g(~λ, ~ν) = inf~x L(~x,~λ, ~ν) We now make a couple of simple observations. Observation. When L(·, ~λ, ~ν) is unbounded from below then the dual takes the value −∞. Observation. g(~λ, ~ν) is concave1 as it is the infimum of a set of affine2 functions. If x is feasible solution of program (10.2)(10.4), then we have the following L(x,~λ, ~ν) = f0(x)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Naval Research Logistics Quarterly

سال: 1979

ISSN: 0028-1441

DOI: 10.1002/nav.3800260401